Discrete Function KL Spectrum Computation over Symmetry Groups of Arbitrary Size
نویسندگان
چکیده
The Karhunen-Loève spectrum of a discrete function can vary depending on how symmetry group objects are mapped to function minterms. For completely specified functions with a range space smaller than the cardinality of a symmetry group, we propose a technique to assign the symmetry group don’t cares to maximize the number of zero-valued KL spectral coefficients of the function. To evaluate these approaches, we compare the average number of zero-valued KL spectral coefficients with those occurring in the Chrestenson spectrum.
منابع مشابه
Universal Conductance Distribution in the Quantum Size Regime
We study the conductance (g) distribution function of an ensemble of isolated conducting rings, with an Aharonov–Bohm flux. This is done in the discrete spectrum limit, i.e., when the inelastic rate, frequency and temperature are all smaller than the mean level spacing. Over a wide range of g the distribution function exhibits universal behavior P (g) ∼ g−(4+β)/3, where β = 1(2) for systems wit...
متن کاملA contribution to approximate analytical evaluation of Fourier series via an Applied Analysis standpoint; an application in turbulence spectrum of eddies
In the present paper, we shall attempt to make a contribution to approximate analytical evaluation of the harmonic decomposition of an arbitrary continuous function. The basic assumption is that the class of functions that we investigate here, except the verification of Dirichlet's principles, is concurrently able to be expanded in Taylor's representation, over a particular interval of their do...
متن کاملLinearly-solvable Markov decision problems
Advances in Neural Information Processing Systems 2006 We introduce a class of MPDs which greatly simplify Reinforcement Learning. They have discrete state spaces and continuous control spaces. The controls have the effect of rescaling the transition probabilities of an underlying Markov chain. A control cost penalizing KL divergence between controlled and uncontrolled transition probabilities ...
متن کاملComputational complexity of an optical model of computation
We investigate the computational complexity of an optically inspired model of computation. The model is called the continuous space machine and operates in discrete timesteps over a number of two-dimensional complexvalued images of constant size and arbitrary spatial resolution. We define a number of optically inspired complexity measures and data representations for the model. We show the grow...
متن کاملOn the Essential Spectrum of Many-Particle Pseudorelativistic Hamiltonians with Permutational Symmetry Account
In this paper we formulate our results on the essential spectrum of many-particle pseudorelativistic Hamiltonians without magnetic and external potential fields in the spaces of functions, having arbitrary type α of the permutational symmetry. We discover location of the essential spectrum for all α and for some cases we establish new properties of the lower bound of this spectrum, which are us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005